Matrix product states represent ground states faithfully

نویسندگان

  • F. Verstraete
  • J. I. Cirac
چکیده

We quantify how well matrix product states approximate exact ground states of one-dimensional quantum spin systems as a function of the number of spins and the entropy of blocks of spins. We also investigate the convex set of local reduced density operators of translational invariant systems. The results give a theoretical justification for the high accuracy of renormalization group algorithms and justifies their use even in the case of critical systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Existence of ground states for approximately inner two--parameter $C_0$--groups on $C^*$--algebras

In this paper, we generalize the definitions of approximately inner $C_0$-groups and their ground states to the two- parameter case and study necessary and sufficient conditions for a state to be ground state. Also we prove that any approximately inner two- parameter $C_0$--group must have at least one ground state. Finally some applications are given.

متن کامل

Matrix product state and mean-field solutions for one-dimensional systems can be found efficiently

We consider the problem of approximating ground states of one-dimensional quantum systems within the two most common variational ansatzes, namely, the mean-field ansatz and matrix product states. We show that both for mean field and for matrix product states of fixed bond dimension, the optimal solutions can be found in a way which is provably efficient (i.e., scales polynomially). This implies...

متن کامل

Tangent space methods for matrix product states

In these lecture notes we give a technical overview of tangent-space methods for matrix product states in the thermodynamic limit. We introduce the manifold of uniform matrix product states, show how to compute different types of observables, and discuss the concept of a tangent space. We explain how to optimize ground-state approximations, implement real-time evolution and describe elementary ...

متن کامل

Computational difficulty of finding matrix product ground states.

We determine the computational difficulty of finding ground states of one-dimensional (1D) Hamiltonians, which are known to be matrix product states (MPS). To this end, we construct a class of 1D frustration-free Hamiltonians with unique MPS ground states and a polynomial gap above, for which finding the ground state is at least as hard as factoring. Without the uniqueness of the ground state, ...

متن کامل

Product Vacua with Boundary States

We introduce a family of quantum spin chains with nearest neighbor interactions that can serve to clarify and refine the classification of gapped quantum phases of such systems. The gapped ground states of these models can be described as a product vacuum with a finite number of particles bound to the edges. The numbers of particles, nL and nR, that can bind to the left and right edges of the f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006